منابع مشابه
Convergence Rates for Generalized Descents
d -descents are permutation statistics that generalize the notions of descents and inversions. It is known that the distribution of d -descents of permutations of length n satisfies a central limit theorem as n goes to infinity. We provide an explicit formula for the mean and variance of these statistics and obtain bounds on the rate of convergence using Stein’s method. Introduction For π ∈ Sn,...
متن کاملGeneralized Descents and Normality
We use Janson’s dependency criterion to prove that the distribution of d-descents of permutations of length n converge to a normal distribution as n goes to infinity. We show that this remains true even if d is allowed to grow with n.
متن کاملGeneralized Mirror Descents in Congestion Games
Different types of dynamics have been studied in repeated game play, and one of them which has received much attention recently consists of those based on “no-regret” algorithms from the area of machine learning. It is known that dynamics based on generic no-regret algorithms may not converge to Nash equilibria in general, but to a larger set of outcomes, namely coarse correlated equilibria. Mo...
متن کاملConvergence rates for linear
In this work, we examine a finite-dimensional linear inverse problem where the measurements are disturbed by an additive normal noise. The problem is solved both in the frequentist and in the Bayesian frameworks. Convergence of the used methods when the noise tends to zero is studied in the Ky Fan metric. The obtained convergence rate results and parameter choice rules are of a similar structur...
متن کاملConvergence Rates for Monte
This paper gives a brief overview of techniques developed recently for analyzing the rate of convergence to equilibrium in Markov chain Monte Carlo experiments. A number of applications in statistical physics are mentioned, and extensive references provided.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/723